πŸ‘©β€πŸ’» 17686. 파일λͺ… μ •λ ¬

@Seongukbaek Posted May 27, 2022 Β· Updated May 27, 2022 Β· 1 min read

문제

Programmers - 파일λͺ… μ •λ ¬

πŸ“ Logic

fileList.sort(((o1, o2) -> { // headκ°€ λ™μΌν•˜λ‹€λ©΄, number κΈ°μ€€ μ˜€λ¦„μ°¨μˆœ μ •λ ¬ if (o1.head.compareTo(o2.head) == 0) return o1.number - o2.number; // head κΈ°μ€€ μ‚¬μ „μˆœ μ •λ ¬ return o1.head.compareTo(o2.head); }));
  • head κ°€ λ™μΌν•œ κ²½μš°μ™€ λ™μΌν•˜μ§€ μ•Šμ€ κ²½μš°μ— λŒ€ν•œ μ •λ ¬ 쑰건 λͺ…μ‹œ

πŸ“„ CODE

μ½”λ“œ 보기/μ ‘κΈ°πŸ’«
import java.util.*; import java.util.regex.Matcher; import java.util.regex.Pattern; class File { // λ³€ν™˜ν•˜μ§€ μ•Šμ€ 원본 파일λͺ… String file; String head; int number; public File(String file) { this.file = file; file = file.toLowerCase(); // μˆ«μžκ°€ μ—°μ†μ΄κ±°λ‚˜, μˆ«μžκ°€ μ•„λ‹Œ λ¬Έμžκ°€ 연속인 경우 μ°ΎκΈ° Pattern p = Pattern.compile("\\d+|\\D+"); Matcher matcher = p.matcher(file); matcher.find(); this.head = matcher.group(0); matcher.find(); this.number = Integer.parseInt(matcher.group(0)); } } class Solution { public String[] solution(String[] files) { ArrayList<File> fileList = new ArrayList<>(); for (String file : files) fileList.add(new File(file)); fileList.sort(((o1, o2) -> { // headκ°€ λ™μΌν•˜λ‹€λ©΄, number κΈ°μ€€ μ˜€λ¦„μ°¨μˆœ μ •λ ¬ if (o1.head.compareTo(o2.head) == 0) return o1.number - o2.number; // head κΈ°μ€€ μ‚¬μ „μˆœ μ •λ ¬ return o1.head.compareTo(o2.head); })); String[] answer = new String[files.length]; for (int i = 0; i < fileList.size(); i++) answer[i] = fileList.get(i).file; return answer; } }

✏️ Review

  • head 와 number 에 λŒ€ν•œ μ •λ ¬ 쑰건만 μ„Έμš΄λ‹€λ©΄ ν•΄κ²°λ˜λŠ” 문제!
@Seongukbaek
배우고 μ •λ¦¬ν•˜κ³  κ³΅μœ ν•˜λŠ” λŒ€ν•™μƒ λ°±μ„±μš±μž…λ‹ˆλ‹€ πŸ˜€